#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
using namespace std;
const int N=105;
int n;
struct node{
    double x,y;
}a[N];
bool cmp(node a,node b){
    //return (a.y/fabs(a.x))<(b.y/fabs(b.x));
    return atan2(a.y,a.x)<atan2(b.y,b.x);
}
int main(void){
    while(~scanf("%d",&n)){
        if(n<0){
            break;
        }
        for(int i=0;i<n;i++){
            a[i].x=a[i].y=0.0;
        }
        for(int i=0;i<n;i++){
            scanf("%lf%lf",&a[i].x,&a[i].y);
        }
        sort(a,a+n,cmp);
        for(int i=0;i<n-1;i++){
            printf("%.1lf %.1lf ",a[i].x,a[i].y);
        }
        printf("%.1lf %.1lf\n",a[n-1].x,a[n-1].y);
    }
    return 0;
}